A class of zero divisor rings in which every graph is precisely the union of a complete graph and a complete bipartite graph
نویسندگان
چکیده
منابع مشابه
THE ZERO-DIVISOR GRAPH OF A MODULE
Let R be a commutative ring with identity and M an R-module. In this paper, we associate a graph to M, sayΓ(RM), such that when M=R, Γ(RM) coincide with the zero-divisor graph of R. Many well-known results by D.F. Anderson and P.S. Livingston have been generalized for Γ(RM). We Will show that Γ(RM) is connected withdiam Γ(RM)≤ 3 and if Γ(RM) contains a cycle, then Γ(RM)≤4. We will also show tha...
متن کاملthe zero-divisor graph of a module
let $r$ be a commutative ring with identity and $m$ an $r$-module. in this paper, we associate a graph to $m$, say ${gamma}({}_{r}m)$, such that when $m=r$, ${gamma}({}_{r}m)$ coincide with the zero-divisor graph of $r$. many well-known results by d.f. anderson and p.s. livingston have been generalized for ${gamma}({}_{r}m)$. we show that ${gamma}({}_{r}m)$ is connected with ${diam}({gamma}({}_...
متن کاملa note on the zero divisor graph of a lattice
abstract. let $l$ be a lattice with the least element $0$. an element $xin l$ is a zero divisor if $xwedge y=0$ for some $yin l^*=lsetminus left{0right}$. the set of all zero divisors is denoted by $z(l)$. we associate a simple graph $gamma(l)$ to $l$ with vertex set $z(l)^*=z(l)setminus left{0right}$, the set of non-zero zero divisors of $l$ and distinct $x,yin z(l)^*$ are adjacent if and only...
متن کاملMedian and Center of Zero-Divisor Graph of Commutative Semigroups
For a commutative semigroup S with 0, the zero-divisor graph of S denoted by &Gamma(S) is the graph whose vertices are nonzero zero-divisor of S, and two vertices x, y are adjacent in case xy = 0 in S. In this paper we study median and center of this graph. Also we show that if Ass(S) has more than two elements, then the girth of &Gamma(S) is three.
متن کاملgroups for which the noncommuting graph is a split graph
the noncommuting graph $nabla (g)$ of a group $g$ is asimple graph whose vertex set is the set of noncentral elements of$g$ and the edges of which are the ones connecting twononcommuting elements. we determine here, up to isomorphism, thestructure of any finite nonabeilan group $g$ whose noncommutinggraph is a split graph, that is, a graph whose vertex set can bepartitioned into two sets such t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2015
ISSN: 2391-5455
DOI: 10.1515/math-2015-0050